A Trajectory Data Clustering Method Based On Dynamic Grid Density

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Trajectory Data Clustering Method Based On Dynamic Grid Density

Under the traditional method of frequent trajectory mining, the location of data is obtained through the GPS device. However, limited equipment accuracy may incur location ambiguity. In this paper, we propose a new trajectory data clustering method based on dynamic grid density, in order to remove this ambiguity. In this method, the trajectory space of an object is firstly divided into equal-si...

متن کامل

An Adaptive Trajectory Clustering Method Based on Grid and Density in Mobile Pattern Analysis

Clustering analysis is one of the most important issues in trajectory data mining. Trajectory clustering can be widely applied in the detection of hotspots, mobile pattern analysis, urban transportation control, and hurricane prediction, etc. To obtain good clustering performance, the existing trajectory clustering approaches need to input one or more parameters to calibrate the optimal values,...

متن کامل

Self-adaptive Trajectory Prediction Method Based on Density Clustering

To solve the problem of user trajectory prediction in the mobile communication environment, we proposed a self-adaptive trajectory prediction method (ATPDC) based on density clustering. And it consists of two stages which are trajectory modeling stage and trajectory updating stage respectively. In the first stage, it constructs the user trajectory prediction model by clustering historical traje...

متن کامل

Dynamic Replication based on Firefly Algorithm in Data Grid

In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...

متن کامل

Density Based k-Nearest Neighbors Clustering Algorithm for Trajectory Data

With widespread availability of low cost GPS, cellular phones, satellite imagery, robotics, Web traffic monitoring devices, it is becoming possible to record and store data about the movement of people and objects at a large amount. While these data hide important knowledge for the enhancement of location and mobility oriented infrastructures and services, by themselves, they demand the necessa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Grid and Distributed Computing

سال: 2015

ISSN: 2005-4262,2005-4262

DOI: 10.14257/ijgdc.2015.8.2.01